TSTP Solution File: ITP194^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP194^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:07:17 EDT 2024
% Result : Theorem 0.37s 0.65s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 20
% Syntax : Number of formulae : 51 ( 14 unt; 12 typ; 0 def)
% Number of atoms : 73 ( 18 equ; 0 cnn)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 215 ( 37 ~; 22 |; 4 &; 144 @)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 44 ( 0 ^ 44 !; 0 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
poly_real: $tType ).
thf(decl_sort2,type,
real: $tType ).
thf(decl_31,type,
zero_zero_real: real ).
thf(decl_37,type,
ord_less_real: real > real > $o ).
thf(decl_41,type,
ord_less_eq_real: real > real > $o ).
thf(decl_43,type,
ord_min_real: real > real > real ).
thf(decl_57,type,
poly_real2: poly_real > real > real ).
thf(decl_73,type,
lb1: real ).
thf(decl_74,type,
lb2: real ).
thf(decl_75,type,
lb: real ).
thf(decl_76,type,
p: poly_real ).
thf(decl_222,type,
esk145_0: real ).
thf(fact_275_order_Oasym,axiom,
! [X9: real,X10: real] :
( ( ord_less_real @ X9 @ X10 )
=> ~ ( ord_less_real @ X10 @ X9 ) ),
file('/export/starexec/sandbox/tmp/tmp.xbaBSb4x4l/E---3.1_22047.p',fact_275_order_Oasym) ).
thf(fact_0_lb1,axiom,
! [X1: real] :
( ( ( poly_real2 @ p @ X1 )
= zero_zero_real )
=> ( ord_less_real @ lb1 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.xbaBSb4x4l/E---3.1_22047.p',fact_0_lb1) ).
thf(fact_31_min__less__iff__conj,axiom,
! [X29: real,X30: real,X31: real] :
( ( ord_less_real @ X29 @ ( ord_min_real @ X30 @ X31 ) )
<=> ( ( ord_less_real @ X29 @ X30 )
& ( ord_less_real @ X29 @ X31 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xbaBSb4x4l/E---3.1_22047.p',fact_31_min__less__iff__conj) ).
thf(conj_0,conjecture,
! [X12: real] :
( ( ( poly_real2 @ p @ X12 )
!= zero_zero_real )
| ( ord_less_real @ lb @ X12 ) ),
file('/export/starexec/sandbox/tmp/tmp.xbaBSb4x4l/E---3.1_22047.p',conj_0) ).
thf(fact_328_leI,axiom,
! [X462: real,X31: real] :
( ~ ( ord_less_real @ X462 @ X31 )
=> ( ord_less_eq_real @ X31 @ X462 ) ),
file('/export/starexec/sandbox/tmp/tmp.xbaBSb4x4l/E---3.1_22047.p',fact_328_leI) ).
thf(fact_1_lb__def,axiom,
( lb
= ( ord_min_real @ lb1 @ lb2 ) ),
file('/export/starexec/sandbox/tmp/tmp.xbaBSb4x4l/E---3.1_22047.p',fact_1_lb__def) ).
thf(fact_288_less__irrefl,axiom,
! [X397: real] :
~ ( ord_less_real @ X397 @ X397 ),
file('/export/starexec/sandbox/tmp/tmp.xbaBSb4x4l/E---3.1_22047.p',fact_288_less__irrefl) ).
thf(fact_200_dual__order_Oantisym,axiom,
! [X10: real,X9: real] :
( ( ord_less_eq_real @ X10 @ X9 )
=> ( ( ord_less_eq_real @ X9 @ X10 )
=> ( X9 = X10 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xbaBSb4x4l/E---3.1_22047.p',fact_200_dual__order_Oantisym) ).
thf(c_0_8,plain,
! [X9: real,X10: real] :
( ( ord_less_real @ X9 @ X10 )
=> ~ ( ord_less_real @ X10 @ X9 ) ),
inference(fof_simplification,[status(thm)],[fact_275_order_Oasym]) ).
thf(c_0_9,plain,
! [X2098: real,X2099: real] :
( ~ ( ord_less_real @ X2098 @ X2099 )
| ~ ( ord_less_real @ X2099 @ X2098 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
thf(c_0_10,plain,
! [X1406: real] :
( ( ( poly_real2 @ p @ X1406 )
!= zero_zero_real )
| ( ord_less_real @ lb1 @ X1406 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_lb1])])]) ).
thf(c_0_11,plain,
! [X1452: real,X1453: real,X1454: real] :
( ( ( ord_less_real @ X1452 @ X1453 )
| ~ ( ord_less_real @ X1452 @ ( ord_min_real @ X1453 @ X1454 ) ) )
& ( ( ord_less_real @ X1452 @ X1454 )
| ~ ( ord_less_real @ X1452 @ ( ord_min_real @ X1453 @ X1454 ) ) )
& ( ~ ( ord_less_real @ X1452 @ X1453 )
| ~ ( ord_less_real @ X1452 @ X1454 )
| ( ord_less_real @ X1452 @ ( ord_min_real @ X1453 @ X1454 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_31_min__less__iff__conj])])])]) ).
thf(c_0_12,negated_conjecture,
~ ! [X12: real] :
( ( ( poly_real2 @ p @ X12 )
!= zero_zero_real )
| ( ord_less_real @ lb @ X12 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_13,plain,
! [X462: real,X31: real] :
( ~ ( ord_less_real @ X462 @ X31 )
=> ( ord_less_eq_real @ X31 @ X462 ) ),
inference(fof_simplification,[status(thm)],[fact_328_leI]) ).
thf(c_0_14,plain,
! [X2: real,X1: real] :
( ~ ( ord_less_real @ X1 @ X2 )
| ~ ( ord_less_real @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
! [X1: real] :
( ( ord_less_real @ lb1 @ X1 )
| ( ( poly_real2 @ p @ X1 )
!= zero_zero_real ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
! [X1: real,X2: real,X7: real] :
( ( ord_less_real @ X1 @ X2 )
| ~ ( ord_less_real @ X1 @ ( ord_min_real @ X2 @ X7 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,plain,
( lb
= ( ord_min_real @ lb1 @ lb2 ) ),
inference(split_conjunct,[status(thm)],[fact_1_lb__def]) ).
thf(c_0_18,negated_conjecture,
( ( ( poly_real2 @ p @ esk145_0 )
= zero_zero_real )
& ~ ( ord_less_real @ lb @ esk145_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
thf(c_0_19,plain,
! [X2233: real,X2234: real] :
( ( ord_less_real @ X2233 @ X2234 )
| ( ord_less_eq_real @ X2234 @ X2233 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
thf(c_0_20,plain,
! [X1: real] :
( ( ( poly_real2 @ p @ X1 )
!= zero_zero_real )
| ~ ( ord_less_real @ X1 @ lb1 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_21,plain,
! [X1: real] :
( ( ord_less_real @ X1 @ lb1 )
| ~ ( ord_less_real @ X1 @ lb ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,plain,
! [X397: real] :
~ ( ord_less_real @ X397 @ X397 ),
inference(fof_simplification,[status(thm)],[fact_288_less__irrefl]) ).
thf(c_0_23,plain,
! [X1800: real,X1801: real] :
( ~ ( ord_less_eq_real @ X1800 @ X1801 )
| ~ ( ord_less_eq_real @ X1801 @ X1800 )
| ( X1801 = X1800 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_200_dual__order_Oantisym])])]) ).
thf(c_0_24,negated_conjecture,
~ ( ord_less_real @ lb @ esk145_0 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_25,plain,
! [X2: real,X1: real] :
( ( ord_less_real @ X1 @ X2 )
| ( ord_less_eq_real @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_26,plain,
! [X1: real] :
( ( ( poly_real2 @ p @ X1 )
!= zero_zero_real )
| ~ ( ord_less_real @ X1 @ lb ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_27,plain,
! [X2127: real] :
~ ( ord_less_real @ X2127 @ X2127 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_22])]) ).
thf(c_0_28,plain,
! [X2: real,X1: real] :
( ( X2 = X1 )
| ~ ( ord_less_eq_real @ X1 @ X2 )
| ~ ( ord_less_eq_real @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_29,negated_conjecture,
ord_less_eq_real @ esk145_0 @ lb,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_30,plain,
! [X1: real] :
( ( ord_less_eq_real @ lb @ X1 )
| ( ( poly_real2 @ p @ X1 )
!= zero_zero_real ) ),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
thf(c_0_31,negated_conjecture,
( ( poly_real2 @ p @ esk145_0 )
= zero_zero_real ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_32,plain,
! [X1: real] :
~ ( ord_less_real @ X1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_33,negated_conjecture,
( ( esk145_0 = lb )
| ~ ( ord_less_eq_real @ lb @ esk145_0 ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_34,negated_conjecture,
ord_less_eq_real @ lb @ esk145_0,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_35,plain,
~ ( ord_less_real @ lb1 @ lb ),
inference(spm,[status(thm)],[c_0_32,c_0_21]) ).
thf(c_0_36,negated_conjecture,
esk145_0 = lb,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
thf(c_0_37,plain,
( ( poly_real2 @ p @ lb )
!= zero_zero_real ),
inference(spm,[status(thm)],[c_0_35,c_0_15]) ).
thf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.16 % Problem : ITP194^1 : TPTP v8.1.2. Released v7.5.0.
% 0.15/0.17 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n003.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Fri May 3 12:20:20 EDT 2024
% 0.15/0.38 % CPUTime :
% 0.35/0.54 Running higher-order theorem proving
% 0.35/0.54 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.xbaBSb4x4l/E---3.1_22047.p
% 0.37/0.65 # Version: 3.1.0-ho
% 0.37/0.65 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.37/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.65 # Starting new_ho_10 with 1500s (5) cores
% 0.37/0.65 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.37/0.65 # Starting full_lambda_6 with 300s (1) cores
% 0.37/0.65 # Starting full_lambda_9 with 300s (1) cores
% 0.37/0.65 # new_ho_10 with pid 22125 completed with status 0
% 0.37/0.65 # Result found by new_ho_10
% 0.37/0.65 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.37/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.65 # Starting new_ho_10 with 1500s (5) cores
% 0.37/0.65 # No SInE strategy applied
% 0.37/0.65 # Search class: HGHSM-FSLM32-MHFFFSBC
% 0.37/0.65 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.65 # Starting additional_ho_6 with 811s (1) cores
% 0.37/0.65 # Starting new_ho_10 with 151s (1) cores
% 0.37/0.65 # Starting new_ho_3 with 136s (1) cores
% 0.37/0.65 # Starting sh3 with 136s (1) cores
% 0.37/0.65 # Starting pre_casc_2 with 136s (1) cores
% 0.37/0.65 # pre_casc_2 with pid 22133 completed with status 0
% 0.37/0.65 # Result found by pre_casc_2
% 0.37/0.65 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.37/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.65 # Starting new_ho_10 with 1500s (5) cores
% 0.37/0.65 # No SInE strategy applied
% 0.37/0.65 # Search class: HGHSM-FSLM32-MHFFFSBC
% 0.37/0.65 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.65 # Starting additional_ho_6 with 811s (1) cores
% 0.37/0.65 # Starting new_ho_10 with 151s (1) cores
% 0.37/0.65 # Starting new_ho_3 with 136s (1) cores
% 0.37/0.65 # Starting sh3 with 136s (1) cores
% 0.37/0.65 # Starting pre_casc_2 with 136s (1) cores
% 0.37/0.65 # Preprocessing time : 0.007 s
% 0.37/0.65 # Presaturation interreduction done
% 0.37/0.65
% 0.37/0.65 # Proof found!
% 0.37/0.65 # SZS status Theorem
% 0.37/0.65 # SZS output start CNFRefutation
% See solution above
% 0.37/0.65 # Parsed axioms : 415
% 0.37/0.65 # Removed by relevancy pruning/SinE : 0
% 0.37/0.65 # Initial clauses : 778
% 0.37/0.65 # Removed in clause preprocessing : 94
% 0.37/0.65 # Initial clauses in saturation : 684
% 0.37/0.65 # Processed clauses : 1074
% 0.37/0.65 # ...of these trivial : 8
% 0.37/0.65 # ...subsumed : 344
% 0.37/0.65 # ...remaining for further processing : 722
% 0.37/0.65 # Other redundant clauses eliminated : 116
% 0.37/0.65 # Clauses deleted for lack of memory : 0
% 0.37/0.65 # Backward-subsumed : 3
% 0.37/0.65 # Backward-rewritten : 14
% 0.37/0.65 # Generated clauses : 1509
% 0.37/0.65 # ...of the previous two non-redundant : 1079
% 0.37/0.65 # ...aggressively subsumed : 0
% 0.37/0.65 # Contextual simplify-reflections : 0
% 0.37/0.65 # Paramodulations : 1381
% 0.37/0.65 # Factorizations : 6
% 0.37/0.65 # NegExts : 2
% 0.37/0.65 # Equation resolutions : 118
% 0.37/0.65 # Disequality decompositions : 0
% 0.37/0.65 # Total rewrite steps : 364
% 0.37/0.65 # ...of those cached : 256
% 0.37/0.65 # Propositional unsat checks : 0
% 0.37/0.65 # Propositional check models : 0
% 0.37/0.65 # Propositional check unsatisfiable : 0
% 0.37/0.65 # Propositional clauses : 0
% 0.37/0.65 # Propositional clauses after purity: 0
% 0.37/0.65 # Propositional unsat core size : 0
% 0.37/0.65 # Propositional preprocessing time : 0.000
% 0.37/0.65 # Propositional encoding time : 0.000
% 0.37/0.65 # Propositional solver time : 0.000
% 0.37/0.65 # Success case prop preproc time : 0.000
% 0.37/0.65 # Success case prop encoding time : 0.000
% 0.37/0.65 # Success case prop solver time : 0.000
% 0.37/0.65 # Current number of processed clauses : 248
% 0.37/0.65 # Positive orientable unit clauses : 62
% 0.37/0.65 # Positive unorientable unit clauses: 4
% 0.37/0.65 # Negative unit clauses : 26
% 0.37/0.65 # Non-unit-clauses : 156
% 0.37/0.65 # Current number of unprocessed clauses: 1029
% 0.37/0.65 # ...number of literals in the above : 2572
% 0.37/0.65 # Current number of archived formulas : 0
% 0.37/0.65 # Current number of archived clauses : 366
% 0.37/0.65 # Clause-clause subsumption calls (NU) : 29775
% 0.37/0.65 # Rec. Clause-clause subsumption calls : 19370
% 0.37/0.65 # Non-unit clause-clause subsumptions : 289
% 0.37/0.65 # Unit Clause-clause subsumption calls : 1562
% 0.37/0.65 # Rewrite failures with RHS unbound : 0
% 0.37/0.65 # BW rewrite match attempts : 111
% 0.37/0.65 # BW rewrite match successes : 90
% 0.37/0.65 # Condensation attempts : 1074
% 0.37/0.65 # Condensation successes : 26
% 0.37/0.65 # Termbank termtop insertions : 74837
% 0.37/0.65 # Search garbage collected termcells : 14144
% 0.37/0.65
% 0.37/0.65 # -------------------------------------------------
% 0.37/0.65 # User time : 0.079 s
% 0.37/0.65 # System time : 0.009 s
% 0.37/0.65 # Total time : 0.088 s
% 0.37/0.65 # Maximum resident set size: 5168 pages
% 0.37/0.65
% 0.37/0.65 # -------------------------------------------------
% 0.37/0.65 # User time : 0.310 s
% 0.37/0.65 # System time : 0.041 s
% 0.37/0.65 # Total time : 0.350 s
% 0.37/0.65 # Maximum resident set size: 2536 pages
% 0.37/0.65 % E---3.1 exiting
% 0.37/0.65 % E exiting
%------------------------------------------------------------------------------